Prodigy planning algorithm

نویسندگان

  • Eugene Fink
  • Manuela M. Veloso
چکیده

We present a formal description of the planning algorithm used in the Prodigy4.0 system. The algorithm is based on an interesting combination of backward-chaining planning and simulation of plan execution. The backward-chainer selects goal-relevant operators, and then Prodigy simulates their application to the current state of the world. The system can use di erent backward-chaining procedures, some of which are presented in the paper. This research is sponsored by the Wright Laboratory, Aeronautical Systems Center, Air Force Materiel Command, USAF, and the Advanced Research Projects Agency (ARPA) under grant number F33615-931-1330. The views and conclusions contained in this document are those of the authors and should not be interpreted as necessarily representing the o cial policies or endorsements, either expressed or implied, of Wright Laboratory or the U. S. Government. The U. S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon. This manuscript is submitted for publication with the understanding that the U. S. Government is authorized to reproduce and distribute reprints for Governmental purposes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formalizing the PRODIGY Planning Algorithm

The PRODIGY project is primarily concerned with the integration of planning and learning. Members of the PRODIGY research group have developed many learning algorithms for improving planning efficiency and plan quality, and for automatically acquiring knowledge about the properties of planning domains. The details of the PRODIGY planning algorithm, however, have not been described in the litera...

متن کامل

Prodigy bidirectional planning

The prodigy system is based on bidirectional planning, which is a combination of goal-directed reasoning with simulated execution. Researchers have implemented a series of planners that utilize this search strategy, and demonstrated that it is an efficient technique, a fair match for other successful planners; however, they have provided few formal results on the common principles underlying th...

متن کامل

Towards Mixed-Initiative Rationale-Supported Planning

This paper introduces our work on mixed-initiative, rationale-supported planning. The work centers on the principled reuse and modi cation of past plans by exploiting their justi cation structure. The goal is to record as much as possible of the rationale underlying each planning decision in a mixed-initiative framework where human and machine planners interact. This rationale is used to determ...

متن کامل

An Evaluation of Blackbox Graph Planning

In this paper, we investigate a satisfiability-based approach to solving STRIPS planning problems. Traditionally, popular algorithms for STRIPS planning problems include a stable of total-order planners, such as Prodigy, and partial-order planners, such as UCPOP. Blum and Furst introduced a novel way of constructing solutions for these problems called Graphplan, which significantly outperformed...

متن کامل

The PRODIGY User Interface

The PRODIGY user interface supports the process of both building and running a planning domain in PRODIGY. It was designed to be highly modular, requiring no changes to the code of the PRODIGY planner to run, and extensible, so that interfaces to other modules built on PRODIGY could easily be integrated into the interface. In this paper we describe how these goals were achieved. We demonstrate ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994